A New Bound on Hrushovski's Algorithm for Computing the Galois Group of a Linear Differential Equation
نویسنده
چکیده
The complexity of computing the Galois group of a linear differential equation is of general interest. In a recent work, Feng gave the first degree bound on Hrushovski’s algorithm for computing the Galois group of a linear differential equation. This bound is the degree bound of the polynomials used in the first step of the algorithm for finding a proto-Galois group (see Definition 2.8) and is sextuply exponential in the order of the differential equation. In this paper, we use Szántó’s algorithm of triangular representation for algebraic sets to analyze the complexity of computing the Galois group of a linear differential equation and we give a new bound which is triple exponential in the order of the given differential equation. keywords: differential Galois groups, linear differential equations, algorithms, triangular sets
منابع مشابه
Notes on Hrushovski's Algorithm for Computing the Galois Group of a Linear Differential Equation
We present a detailed and simplified version of Hrushovski’s algorithm that determines the Galois group of a linear differential equation. There are three major ingredients in this algorithm. The first is to look for a degree bound for proto-Galois groups, which enables one to compute one of them. The second is to determine the identity component of the Galois group that is the pullback of a to...
متن کاملNumerical solution of fuzzy linear Fredholm integro-differential equation by \fuzzy neural network
In this paper, a novel hybrid method based on learning algorithmof fuzzy neural network and Newton-Cotesmethods with positive coefficient for the solution of linear Fredholm integro-differential equation of the second kindwith fuzzy initial value is presented. Here neural network isconsidered as a part of large field called neural computing orsoft computing. We propose alearning algorithm from ...
متن کاملLie symmetries and differential Galois groups of linear equations
For a linear ordinary differential equation the Lie algebra of its infinitesimal Lie symmetries is compared with its differential Galois group. For this purpose an algebraic formulation of Lie symmetries is developed. It turns out that there is no direct relation between the two above objects. In connection with this a new algorithm for computing the Lie symmetries of a linear ordinary differen...
متن کاملChebyshev Spectral Collocation Method for Computing Numerical Solution of Telegraph Equation
In this paper, the Chebyshev spectral collocation method(CSCM) for one-dimensional linear hyperbolic telegraph equation is presented. Chebyshev spectral collocation method have become very useful in providing highly accurate solutions to partial differential equations. A straightforward implementation of these methods involves the use of spectral differentiation matrices. Firstly, we transform ...
متن کاملNumerical solution of fuzzy differential equations under generalized differentiability by fuzzy neural network
In this paper, we interpret a fuzzy differential equation by using the strongly generalized differentiability concept. Utilizing the Generalized characterization Theorem. Then a novel hybrid method based on learning algorithm of fuzzy neural network for the solution of differential equation with fuzzy initial value is presented. Here neural network is considered as a part of large eld called ne...
متن کامل